Lecture : Flow - based Methods for Partitioning Graphs ( 2 of 2 )
نویسنده
چکیده
Recall from last time that we are looking at flow-based graph partitioning algorithm. Last time, we covered the basics of flow-based methods, and we showed how they are very different than spectral methods. This time, we will discuss flow-based graph partitioning from an embedding perspective. We will see that flow-based algorithms implicitly embed the data in a metric space, but one that is very different than the place where spectral-based algorithms embed the data. Thus, not only do they run different steps operationally and get incomparable quality of approximation bounds, but also they implicitly put the data in a very different place—thus “explaining” many of the empirical results that are empirically observed.
منابع مشابه
Lecture : Flow - based Methods for Partitioning Graphs ( 1 of 2 )
Last time, we described the properties of expander graphs and showed that they have several “extremal” properties. Before that, we described a vanilla spectral partitioning algorithms, which led to the statement and proof of Cheeger’s Inequality. Recall that one direction viewed λ2 as a relaxation of the conductance or expansion problem; while the other direction gave a “quadratic” bound as wel...
متن کاملDesign and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کاملLecture : Spectral Methods for Partitioning Graphs ( 2 of 2 )
Warning: these notes are still very rough. They provide more details on what we discussed in class, but there may still be some errors, incomplete/imprecise statements, etc. in them. Here, we will prove the easy direction and the hard direction of Cheeger's Inequality. Recall that what we want to show is that λ 2 2 ≤ φ(G) ≤ 2λ 2. For the easy direction, recall that what we want to prove is that...
متن کاملLecture Notes on Spectral Graph Methods
These are lecture notes that are based on the lectures from a class I taught on the topic of Spectral Graph Methods at UC Berkeley during the Spring 2015 semester. Spectral graph techniques are remarkably broad, they are widely-applicable and often very useful, and they also come with a rich underlying theory, some of which provides a very good guide to practice. Spectral graph theory is often ...
متن کاملLecture : Spectral Methods for Partitioning Graphs ( 1 of 2 )
Today and next time, we will cover what is known as spectral graph partitioning, and in particular we will discuss and prove Cheeger’s Inequality. This result is central to all of spectral graph theory as well as a wide range of other related spectral graph methods. (For example, the isoperimetric “capacity control” that it provides underlies a lot of classification, etc. methods in machine lea...
متن کامل